Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(perfectp, 0) -> false
app2(perfectp, app2(s, x)) -> app2(app2(app2(app2(f, x), app2(s, 0)), app2(s, x)), app2(s, x))
app2(app2(app2(app2(f, 0), y), 0), u) -> true
app2(app2(app2(app2(f, 0), y), app2(s, z)), u) -> false
app2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> app2(app2(app2(app2(f, x), u), app2(app2(minus, z), app2(s, x))), u)
app2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u)), app2(app2(app2(app2(f, x), u), z), u))

Q is empty.


↳ QTRS
  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(perfectp, 0) -> false
app2(perfectp, app2(s, x)) -> app2(app2(app2(app2(f, x), app2(s, 0)), app2(s, x)), app2(s, x))
app2(app2(app2(app2(f, 0), y), 0), u) -> true
app2(app2(app2(app2(f, 0), y), app2(s, z)), u) -> false
app2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> app2(app2(app2(app2(f, x), u), app2(app2(minus, z), app2(s, x))), u)
app2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u)), app2(app2(app2(app2(f, x), u), z), u))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(perfectp, 0) -> false
app2(perfectp, app2(s, x)) -> app2(app2(app2(app2(f, x), app2(s, 0)), app2(s, x)), app2(s, x))
app2(app2(app2(app2(f, 0), y), 0), u) -> true
app2(app2(app2(app2(f, 0), y), app2(s, z)), u) -> false
app2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> app2(app2(app2(app2(f, x), u), app2(app2(minus, z), app2(s, x))), u)
app2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u)), app2(app2(app2(app2(f, x), u), z), u))

The set Q consists of the following terms:

app2(perfectp, 0)
app2(perfectp, app2(s, x0))
app2(app2(app2(app2(f, 0), x0), 0), x1)
app2(app2(app2(app2(f, 0), x0), app2(s, x1)), x2)
app2(app2(app2(app2(f, app2(s, x0)), 0), x1), x2)
app2(app2(app2(app2(f, app2(s, x0)), app2(s, x1)), x2), x3)


Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(f, app2(s, x)), app2(app2(minus, y), x))
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(minus, y), x)
APP2(perfectp, app2(s, x)) -> APP2(app2(app2(f, x), app2(s, 0)), app2(s, x))
APP2(perfectp, app2(s, x)) -> APP2(f, x)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(f, x), u)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(le, x)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(if, app2(app2(le, x), y))
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(minus, z)
APP2(perfectp, app2(s, x)) -> APP2(app2(f, x), app2(s, 0))
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(minus, y)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(app2(f, x), u), z)
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(app2(f, x), u)
APP2(perfectp, app2(s, x)) -> APP2(app2(app2(app2(f, x), app2(s, 0)), app2(s, x)), app2(s, x))
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z)
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(f, x)
APP2(perfectp, app2(s, x)) -> APP2(s, 0)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(app2(app2(f, x), u), z), u)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(le, x), y)
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(app2(app2(f, x), u), app2(app2(minus, z), app2(s, x)))
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(app2(minus, z), app2(s, x))
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(app2(app2(app2(f, x), u), app2(app2(minus, z), app2(s, x))), u)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(if, app2(app2(le, x), y)), app2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u))
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(app2(if, app2(app2(le, x), y)), app2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u)), app2(app2(app2(app2(f, x), u), z), u))
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(f, x)

The TRS R consists of the following rules:

app2(perfectp, 0) -> false
app2(perfectp, app2(s, x)) -> app2(app2(app2(app2(f, x), app2(s, 0)), app2(s, x)), app2(s, x))
app2(app2(app2(app2(f, 0), y), 0), u) -> true
app2(app2(app2(app2(f, 0), y), app2(s, z)), u) -> false
app2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> app2(app2(app2(app2(f, x), u), app2(app2(minus, z), app2(s, x))), u)
app2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u)), app2(app2(app2(app2(f, x), u), z), u))

The set Q consists of the following terms:

app2(perfectp, 0)
app2(perfectp, app2(s, x0))
app2(app2(app2(app2(f, 0), x0), 0), x1)
app2(app2(app2(app2(f, 0), x0), app2(s, x1)), x2)
app2(app2(app2(app2(f, app2(s, x0)), 0), x1), x2)
app2(app2(app2(app2(f, app2(s, x0)), app2(s, x1)), x2), x3)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(f, app2(s, x)), app2(app2(minus, y), x))
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(minus, y), x)
APP2(perfectp, app2(s, x)) -> APP2(app2(app2(f, x), app2(s, 0)), app2(s, x))
APP2(perfectp, app2(s, x)) -> APP2(f, x)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(f, x), u)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(le, x)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(if, app2(app2(le, x), y))
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(minus, z)
APP2(perfectp, app2(s, x)) -> APP2(app2(f, x), app2(s, 0))
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(minus, y)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(app2(f, x), u), z)
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(app2(f, x), u)
APP2(perfectp, app2(s, x)) -> APP2(app2(app2(app2(f, x), app2(s, 0)), app2(s, x)), app2(s, x))
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z)
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(f, x)
APP2(perfectp, app2(s, x)) -> APP2(s, 0)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(app2(app2(f, x), u), z), u)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(le, x), y)
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(app2(app2(f, x), u), app2(app2(minus, z), app2(s, x)))
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(app2(minus, z), app2(s, x))
APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(app2(app2(app2(f, x), u), app2(app2(minus, z), app2(s, x))), u)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(if, app2(app2(le, x), y)), app2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u))
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(app2(if, app2(app2(le, x), y)), app2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u)), app2(app2(app2(app2(f, x), u), z), u))
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(f, x)

The TRS R consists of the following rules:

app2(perfectp, 0) -> false
app2(perfectp, app2(s, x)) -> app2(app2(app2(app2(f, x), app2(s, 0)), app2(s, x)), app2(s, x))
app2(app2(app2(app2(f, 0), y), 0), u) -> true
app2(app2(app2(app2(f, 0), y), app2(s, z)), u) -> false
app2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> app2(app2(app2(app2(f, x), u), app2(app2(minus, z), app2(s, x))), u)
app2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u)), app2(app2(app2(app2(f, x), u), z), u))

The set Q consists of the following terms:

app2(perfectp, 0)
app2(perfectp, app2(s, x0))
app2(app2(app2(app2(f, 0), x0), 0), x1)
app2(app2(app2(app2(f, 0), x0), app2(s, x1)), x2)
app2(app2(app2(app2(f, app2(s, x0)), 0), x1), x2)
app2(app2(app2(app2(f, app2(s, x0)), app2(s, x1)), x2), x3)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 1 SCC with 23 less nodes.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> APP2(app2(app2(app2(f, x), u), app2(app2(minus, z), app2(s, x))), u)
APP2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> APP2(app2(app2(app2(f, x), u), z), u)

The TRS R consists of the following rules:

app2(perfectp, 0) -> false
app2(perfectp, app2(s, x)) -> app2(app2(app2(app2(f, x), app2(s, 0)), app2(s, x)), app2(s, x))
app2(app2(app2(app2(f, 0), y), 0), u) -> true
app2(app2(app2(app2(f, 0), y), app2(s, z)), u) -> false
app2(app2(app2(app2(f, app2(s, x)), 0), z), u) -> app2(app2(app2(app2(f, x), u), app2(app2(minus, z), app2(s, x))), u)
app2(app2(app2(app2(f, app2(s, x)), app2(s, y)), z), u) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(app2(app2(f, app2(s, x)), app2(app2(minus, y), x)), z), u)), app2(app2(app2(app2(f, x), u), z), u))

The set Q consists of the following terms:

app2(perfectp, 0)
app2(perfectp, app2(s, x0))
app2(app2(app2(app2(f, 0), x0), 0), x1)
app2(app2(app2(app2(f, 0), x0), app2(s, x1)), x2)
app2(app2(app2(app2(f, app2(s, x0)), 0), x1), x2)
app2(app2(app2(app2(f, app2(s, x0)), app2(s, x1)), x2), x3)

We have to consider all minimal (P,Q,R)-chains.